Resource allocation and scheduling among base stations

ABSTRACT

Various techniques are disclosed for wireless communications for providing a methodology and algorithm(s) to manage resources and schedule users in a coordinated way among a group of base stations, such as Femtocells, Picocells, self-organized Basestations, Access Points (APs) or mesh network nodes, or among the basestations in a two tiered networks, to improve the performance for individual user, individual Basestation (BTS), the overall systems or all of above.

CROSS REFERENCE TO OTHER APPLICATIONS

This application is a continuation of co-pending U.S. patent applicationSer. No. 12/607,859, entitled SYSTEM AND METHOD OF RESOURCE ALLOCATIONAND SCHEDULING AMONG BASE STATIONS, filed Oct. 28, 2009, which claimspriority to U.S. Provisional Patent Application No. 61/109,407, entitledSYSTEM AND METHOD OF RESOURCE ALLOCATION AND SCHEDULING AMONG BASESTATIONS, filed Oct. 29, 2008, which are hereby incorporated byreference.

FIELD OF THE INVENTION

The present disclosure pertains to wireless communications,specifically, methodology and algorithm to management resources andschedule users.

BACKGROUND OF INVENTION AND RELATED ART

There has been a great deal of work on scheduler and resourcemanagement. The general approach is to maximize a cost function subjectto the capacity limit and other constraints such that certainperformance measures are achieved. A great deal of work has been done inthe areas of funding effective cost functions, theoretical proves of theproperty of those functions, solving optimization problems with thosecost functions with respect to different physical layer characteristics,and the correspondent algorithms based those theoretical results. Forexample, a widely used cost function is a utility based function. Themain advantage of a utility based resource management compared to moretraditional system centric criteria, such as power, outage probabilityand throughput, is that it can be used to evaluate to what degree asystem satisfies service requirements of an user's application. [1] andthe references therein give a good overview on state-of-the-art theoriesand algorithms of scheduler and resources management, especially forOFDM based systems.

However, all of the prior arts have mathematically formulated theproblem on the assumptions that a system is one Basestation and all theuser terminals (UEs) being considered are associated with theBasestation under study. As a result, the cost function as well as itsoptimization targets how to maximize a cost function with respect tosome or all users in one BTS subject to the capacity limit and otherconstraints such that certain performance measures are achieved. Hence,the scheduler and resource management algorithms derived from aboveassumption and theory are for scheduling UEs in individual BTS withoutconsidering other BTSs, their corresponding schedulers, and their UEs.Mathematically, the above optimization problem is to assign radioresources in order to maximize the following cost function:

$\frac{1}{M}{\sum\limits_{i = 1}^{M}{U_{i}\left( {r_{i}\lbrack n\rbrack} \right)}}$

Where r_(i)[n] is the instantaneous dates of user i at time n, U_(i)(•)is the corresponding utility function of user i. Again, all the usersare in the same cell or being served by one BTS, and the optimization isdone w.r.t. one cell or BTS.

On implementation side, traditionally, the scheduler resides in the BTS,or NodeB in 3GPP term. The scheduler is responsible for assigning radioresources to the UEs in the cell based on the available radio resources,user channel quality, user request, QoS requirements.

Additional radio resource management residing further above BTSs isresponsible for handoff related resource management, such as orthogonalcode assignment between the cells, application data buffer management,and so on.

SUMMARY OF THE INVENTION

The present embodiments provide methods for wireless communications,specifically, methodology and algorithm to management resources andschedule users in a coordinated way among a group of base stations, suchas Femtocells, Picocells, self-organized Basestations, Access Points(APs) or mesh network nodes, or among the basestations in a two tierednetworks, such as Femtocells within a Macrocell, to improve theperformance for individual user, individual Basestation (BTS), theoverall systems or all of above.

Certain embodiments as disclosed herein provide for mathematicalformulation of the problem, methodology of deriving the solutions, andthe corresponding algorithms to manage resources and schedule usersamong a group of base stations, such as Femtocells, Picocells or AccessPoints (AP), or among the basestations in a two tiered networks, such asFemtocells within a Macrocell, to improve the performance for individualuser, individual Basestation (BTS), the overall systems or all of above.

According there is provided a first method of managing wirelessresources comprising the steps of a) identifying a group of cells withat least two cells as neighboring cells, b) identifying a group of usersfrom the group of the cells, c) providing a utility function for eachuser, d) providing a radio resource allocation objective based upon onecost function for the group of users from the group of cells identifiedin step a) and d) allocating a portion of a resource to each user independence upon a cost function for the group of users.

Accordingly there is provided a second method of managing wirelessresources comprising the steps of a) identifying a group of cells, b)providing a utility function for each cell, c) providing a radioresource allocation objective based on one cost function for the groupof cells identified in step a) and d) allocating a portion of radioresource to each cell such that the objective is met.

Accordingly there is provided a third method of managing wirelessresources comprising the steps of a) identifying a group of cells. b)identifying a group of users from the group of cells, c) providing autility function for a cell or a user or both in the selected group, d)providing a first radio resource allocation objective based on one costfunction for the group of users from the group of cells identified instep b), e) providing a second radio resource allocation objective basedon one cost function for the group of cells identified in step a), f)determining an overall objective is a summation of the first and secondobjectives, and g) allocating a portion of radio resource to each cellor each user such that the overall objective is met.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 illustrates radio resource optimization performed in each of thethree individual cells with respect to the metrics of the terminals ineach cells.

FIG. 2 illustrates an example of radio resource optimization isperformed for all neighboring cells with respect to each individual celllevel metrics.

FIG. 3 illustrates an example of radio resource optimization isperformed for all neighboring cells with respect to the combination ofmetrics of all terminals in some cells and each individual cell levelmetrics for other cells.

FIG. 4 illustrates an example of radio resource optimization isperformed for all neighboring cells with respect to the combination ofmetrics of groups of terminals in some cells and each individual celllevel metrics for other cells.

FIG. 5 shows a flow chart of resource allocation and schedulingalgorithm optimized for the case of a group of users in more than onecell using rate based utility function according to the presentinvention.

FIG. 6 shows a flow chart of resource allocation and schedulingalgorithm optimized for the case of a group of cells using rate basedutility function according to the present invention.

DETAILED DESCRIPTION

After reading this description, it will become apparent to one skilledin the art how to implement the invention in various alternativeembodiments and alternative applications. Although various embodimentsof the present invention are described herein, it is understood thatthese embodiments are presented by way of example only, and notlimitation. As such, this detailed description of various alternativeembodiments should not be construed to limit the scope or breadth of thepresent invention.

In a wireless system, a group of base stations (BTSs) can be managed bya centralized network management identity or can be self-organized bycommunicating with each other via wireless air-interfaces or wiredinterfaces. One such example is Femtocell system. In Femtocell systemwhere Femtocell BTSs are connected to the core networks through wired orwireless broadband connections. The Femtocells are networked via eithera wired backhaul or over-the-air. The provisioning of the Femtocell BTSscan be done either by the core network on a per device basis or in acoordinated fashion either under the complete supervision of the corenetworks, partial supervision of the core networks or withoutsupervision at all.

The Femtocell incorporates the functionality of a typical base stationbut extends it to allow a simpler, self-contained deployment; forexample, a UMTS Femtocell containing a Node B, RNC and GSN with Ethernetfor backhaul. Although much attention is focused on UMTS, the concept isapplicable to all standards, including GSM, CDMA2000, TD-SCDMA and WiMAXsolutions.

When the BTSs are using the same frequency for transmitting andreceiving with relatively large transmitting power and when they arecloser to each other, such as Femtocells, performance such as system anduser throughput or QoS get degraded due to a number factors, such as theinterference between the BTSs and among the users in the same BTS or indifferent BTSs, or in a two-tier networks where Femtocell BTSs arewithin a Macrocell BTS. One contributing factor is that the resourcemanagement and scheduler algorithms today are trying to maximize certaincost functions over some or all UEs in each individual BTS in order toachieve better performance such as user and system throughput.

When a Femtocell system has the capability to network and coordinate viaeither a wired backhaul or over-the-air, resource management andscheduling UEs can be done either by a coordinated fashion either underthe complete supervision of the core networks (completely centralized),partial supervision of the core networks (partially centralized) orwithout supervision at all (distributed).

According to one embodiment of the present invention, a neighbor listwill be formed based on the measurement from users in each BTSs or byeach BTS itself in order to enable scheduling and resource managementamong the BTSs. When the measurements of its neighbor BTSs, such asreference signal strength across all frequency or in certain frequencygroup, the interference level across all frequency or in certainfrequency group, distance in RF signal strength sense, are abovepre-determined thresholds, the BTS(s) will be added to the neighbor listof the said BTS. Optionally, the relative position of the BTSs based themeasurement, such as DOA, is known, the neighbor can also be describedby their topology. The neighbor list changes dynamically based on thereal-time measurements. The server on the network maintains the neighborlist for all the BTSs, and each BTS maintains a copy of its own neighborlist.

According to one embodiment of the present invention, a resourceallocation and scheduling optimization method is proposed where theobjective is to maximize cost function with respect to one or more cellsor BTSs. Constraints other than cost function can be added in theoptimization process.

When the utility function is date rate based, the above optimizationproblem is to allocation radio resources to maximize:

$\sum\limits_{i \in G}{U_{i}\left( r_{i} \right)}$

where U_(i)(•) is the utility functions for an individual user, a groupof users, a cell, or multiple cells, r_(i) is instantaneous data rate oraveraged data rate, depending on the definition of the utility function,of an individual user, a group of users, a cell, or multiple cells. G isa set that consists of

1. A group of users in one cell or BTS

2. A group of users in more than one cells or BTSs

3. A group of cells or BTSs each having one or more users

4. Combination of a group of users in one or more cells and one or agroup of cells.

When G represents a group of users in one cell or BTS, i.e. the 1^(st)case above, it reduces to the model that all prior arts use. Referringto FIG. 1 there is illustrated radio resource optimization is performedin each of the three individual cells with respect to the metrics of theterminals in each cells. In this example, Cell 1 radio resource isoptimized w.r.t. Mobile 1_1 and Mobile 1_2; Cell 2 radio resource isoptimized w.r.t. Mobile 2_1, Mobile 2_2 and Mobile 2_3; Cell 3 radioresource is optimized w.r.t. Mobile 3_1, Mobile 3_2 and Mobile 3_3.

The 2^(nd) through 4^(th) cases are the new model this embodimentdescribes, and are used in deriving the following embodiments.

Referring to FIG. 2 there is illustrated an example of radio resourceoptimization is performed for all neighboring cells with respect to eachindividual cell level metrics. In this example, overall radio resourceis optimized w.r.t. Cell_1, Cell_2 and Cell_3.

Referring to FIG. 3 there is illustrated an example of radio resourceoptimization is performed for all neighboring cells with respect to thecombination of metrics of all terminals in some cells and eachindividual cell level metrics for other cells. In this example, overallradio resource is optimized w.r.t. Cell 1, Mobile 2_1, Mobile 2_2 andMobile 2_3, and Cell 3.

Referring to FIG. 4 there is illustrated an example of radio resourceoptimization is performed for all neighboring cells with respect to thecombination of metrics of groups of terminals in some cells and eachindividual cell level metrics for other cells. In this example, overallradio resource is optimized w.r.t. Cell 1, Cell_2, Mobile 2_3, Cell 3,and Mobile 3_3.

It should be noted that even though data rate based utility function isused herein to illustrate the methodology; the embodiment can be appliedto other types of utility functions. One such example if a delay-basedutility function that is a function of an average waiting time of auser.

According to another embodiment of the present invention, theoptimization problem is to allocation radio resources to maximize thecost function, which is a sum of the users' utility functions where agroup of users may belong to more than one cells or BTSs and they can beassigned to different utility function. The users in each cell canentirely or partially be used in the optimization process depending onthe criteria used in defining the relationship between the users. Otherconstraints than cost function can be added in the optimization process.

Assume the optimization is done for the users across N cells with eachhaving M_(j) users. With rate based utility function, the optimizationproblem is to allocation radio resources to maximize

$\frac{1}{N}{\sum\limits_{j = 1}^{N}{\left( {\frac{1}{M}{\sum\limits_{i = 1}^{M_{j}}{U_{ij}\left( {r_{ij}\lbrack n\rbrack} \right)}}} \right).}}$

Where r_(ij)[n] is the instantaneous data rate of user i in cell j attime n, U_(ij)(•) is the corresponding utility function of user i, M_(j)is number of users used in the optimization in cell j, and N is numberof neighboring cells used in the optimization. Note that M_(j) canrepresent total number of users or portion of the total users, dependingon the optimization criteria or system requirements.

Using an OFDM system and subcarrier assignment as an example, theachievable data rate for user i at subcarrier frequency k for a givendownlink transmission power density p_(j)[k,n] andsignal-to-interference-and-noise ratio (SINR) q_(ij)[k,n] is

c _(ij)(k,n)=f(ln(1+gp _(j) [k,n]q _(ij) [k,n])) bits/sec/Hz

where g is SINR gap. To simplify the derivation, assume continuous rateadaptation is used, we have

c _(ij)(k,n)=ln(1+gp _(j) [k,n]q _(if) [k,n]) bits/sec/Hz

when user i is assigned to subcarrier group K_(i) with subcarrierspacing of Δf, the data rate for user i is

${r_{ij}\left\lbrack {K_{i,}n} \right\rbrack} = {\sum\limits_{k \in K_{i}}{{c_{ij}\left\lbrack {k,n} \right\rbrack}\Delta \; {f.}}}$

Let r_(ij)[K_(i),n] be the data rate for user i at time n and r_(ij)[K_(i),n] be the average data rate for user i at time n, w is theratio of the slot length to the average window. r_(ij)[K_(i),n] can berepresented by

r _(ij) [K _(i) ,n]=(1−w) r _(ij) [K _(i) ,n−1]+wr _(ij) [K _(i) ,n].

Define x_(ijnK) _(i) as

$x_{{ijnK}_{i}} = \left\{ \begin{matrix}{1,} & {{if}\mspace{14mu} {subcarrier}\mspace{14mu} {group}\mspace{14mu} K_{i}\mspace{14mu} {is}\mspace{14mu} {assigned}\mspace{14mu} {to}\mspace{14mu} {user}\mspace{14mu} i\mspace{14mu} {in}\mspace{14mu} {cell}\mspace{14mu} j} \\{0,} & {{otherwise},}\end{matrix} \right.$

the optimization problem as be formulated as

${\max\limits_{x}{\frac{1}{N}{\sum\limits_{j = 1}^{N}\left( {\frac{1}{M}{\sum\limits_{i = 1}^{M_{j}}{U_{ij}\left( {\Delta \; f{\sum\limits_{k \in K_{i}}{{c_{ij}\left\lbrack {k,n} \right\rbrack}x_{{ijnK}_{i}}}}} \right)}}} \right)}}},$

subject to

${{\sum\limits_{j = 1}^{N}\left( {\sum\limits_{i = 1}^{M_{j}}x_{{ijnK}_{i}}} \right)} = 1},{x_{{ijnK}_{i}} \in \left\{ {0,1} \right\}}$

Hence the gradient scheduling algorithm is

$\left\{ {i,j} \right\}_{\lbrack{K_{i},n}\rbrack} = {\underset{({i,j})}{\arg \; \max}\left\{ {{{wU}_{ij}^{\prime}\left( {{\overset{\_}{r}}_{ij}\left\lbrack {K_{i}n} \right\rbrack} \right)}{c_{ij}\left\lbrack {k,n} \right\rbrack}} \right\}}$

where user i can belong to any of the N cells.

Clearly, when the average window length equals to the slot length, r_(ij)[K_(i),n]=r_(ij)[K_(i),n], one could drop the variable n in all ofthe above equations and the gradient scheduling algorithm becomes

$\left\{ {i,j} \right\}_{\lbrack K_{i}\rbrack} = {\underset{({i,j})}{\arg \; \max}\left\{ {{U_{ij}^{\prime}\left( {r_{ij}\left\lbrack K_{i} \right\rbrack} \right)}{c_{ij}\lbrack k\rbrack}} \right\}}$

where user i can belong to any of the N cells.

Even though we refer k as subcarrier frequency, Δf as subcarrierspacing, and K as subcarrier frequency group, one can replace subcarrierfrequency by subcarrier frequency group, subcarrier spacing by totalspacing of subcarrier group, and subcarrier frequency group bysubcarrier frequency group set. The above derivation is then applied toany grouping methods of subcarrier frequency of an OFDM system. The sameargument is also applied to all of the following embodiments.

An example of algorithm flow chart for the above embodiment isillustrated in FIG. 5.

According to one embodiment of the present invention, the optimizationproblem is to allocation radio resources to maximize the cell levelutility function, which is a sum of each cell or BTSs' utilityfunctions. Each cell or BTSs can be assigned to different utilityfunction.

Assume the optimization is done across N cell with one utility functionassigned to each cell. With rate based utility function, theoptimization problem is to allocation radio resources to maximize

$\frac{1}{N}{\sum\limits_{j = 1}^{N}{{U_{j}\left( {r_{j}\lbrack n\rbrack} \right)}.}}$

Where r_(j)[n] is the total or average instantaneous data rate of Musers in cell j at time n, U_(j)(•) is the utility function of cell j,and N is number of neighboring cells used in the optimization. Thedefinition of U_(j)(•) depends on how r_(j)[n] is defined. Astraightforward way to define r_(j)[n] is as the data rate of all theusers, or part of the users in cell j, i.e.

${r_{j}\lbrack n\rbrack} = {\sum\limits_{i = 1}^{M_{j}}{{r_{i}\lbrack n\rbrack}.}}$

When M_(j) is less than the total users in the cell, it represents onlya group of the users.

There are other ways to define r_(j)[n]. For example, it can be definedas average instantaneous data rate of M_(j) users in cell j at time n,

${r_{j}\lbrack n\rbrack} = {\frac{1}{M_{j}}{\sum\limits_{i = 1}^{M_{j}}{{r_{i}\lbrack n\rbrack}.}}}$

When M_(j) is less than the total users in the cell, it represents onlya group of the users. Or it can be defined as maximum instantaneous datarate among M_(j) users in cell j at time n,

${r_{j}\lbrack n\rbrack} = {\max\limits_{i \in M}{{r_{i}\lbrack n\rbrack}.}}$

Using OFDM system and subcarrier assignment as an example and assumecontinuous rate adaptation, the achievable data rate for user i atsubcarrier frequency k for a given downlink transmission power densityp[k, n] and signal-to-interference-and-noise ratio (SINR) q_(i)[k,n] is

c _(i)(k,n)=ln(1+gp[k,n]q _(i) [k,n]) bits/sec/Hz

When cell j is assigned to subcarrier group K with subcarrier spacing ofΔf, the data rate for user or user in cell j that are actually assignedto the resources is

${r_{j}\left\lbrack {K_{j},n} \right\rbrack} = {{\sum\limits_{i}{r_{i}\left\lbrack {K_{i},n} \right\rbrack}} = {\sum\limits_{i}{\sum\limits_{k \in K}{{c_{j}\left\lbrack {k,n} \right\rbrack}\Delta \; f}}}}$

Let r_(j)[K_(j),n] be the data rate for cell j at time n and r_(j)[K_(j),n] be the average data rate for cell j at time n, w is theratio of the slot length to the average window. r _(j)[K_(j),n] can berepresented by

r _(j) [K _(j) ,n]=(1−w) r _(j) [K _(j) ,n−1]+wr _(j) [K _(j) ,n].

Define x_(jnK) _(j) as

$x_{{jnK}_{j}} = \left\{ \begin{matrix}{1,} & {{if}\mspace{14mu} {subcarrier}\mspace{14mu} {group}\mspace{14mu} K_{j,}\mspace{14mu} {is}\mspace{14mu} {assigned}\mspace{14mu} {to}\mspace{14mu} {cell}\mspace{14mu} j} \\{0,} & {{otherwise},}\end{matrix} \right.$

the optimization problem as be formulated as

${\max\limits_{x}{\frac{1}{N}{\sum\limits_{j = 1}^{N}\left( {U_{j}\left( {\Delta \; f{\sum\limits_{k \in K_{i}}{{c_{j}\left\lbrack {k,n} \right\rbrack}x_{{jnK}_{i,}}}}} \right)} \right)}}},$

subject to

${{\sum\limits_{j = 1}^{N}\left( x_{{jnK}_{i,}} \right)} = 1},{x_{{jnK}_{i,}}\mspace{14mu} \in \left\{ {0,1} \right\}}$

Hence the gradient scheduling algorithm is

$\left\{ {i,j} \right\}_{\lbrack{K_{i,},n}\rbrack} = {\underset{j,{i \in M_{j}}}{\arg \; \max}\left\{ {{{wU}_{j}^{\prime}\left( {{\overset{\_}{r}}_{j}\left\lbrack {K_{j,}n} \right\rbrack} \right)}{c_{j}\left\lbrack {k,n} \right\rbrack}} \right\}}$

Even though the optimization is done with respect to the cells, theresource assignment and scheduling can be done on each user or a groupof users in individual cell level. In other words, for each set ofavailable resource, the user in each cell that maximizes the cell levelutility functions is assigned.

Since

${{r_{j}\left\lbrack {K_{j},n} \right\rbrack} = {\sum\limits_{i}{r_{i}\left\lbrack {K_{i},n} \right\rbrack}}},$

the resource assigned to j can then be directly assigned to user orusers that are used to calculate the data rate.

Clearly, when the average window length equals to the slot length, r_(j)[K_(i),n]=r_(j)[K_(i),n], so we could drop the variable n in all ofthe above equations and the gradient scheduling algorithm becomes

$\left\{ {i,j} \right\}_{\lbrack K_{i}\rbrack} = {\underset{j,{i \in M_{j}}}{\arg \; \max}\left\{ {{U_{j}^{\prime}\left( {r_{j}\left\lbrack K_{i} \right\rbrack} \right)}{c_{j}\lbrack k\rbrack}} \right\}}$

An example of algorithm flow chart for the first case of the aboveembodiment is illustrated in FIG. 6.

A more complicated way is to have another level of optimization forresource and scheduling in each individual cell and the results of theresource assignments from each cell is used to select user groups inorder to calculate

${r_{j}\lbrack n\rbrack} = {\sum\limits_{i}{{r_{i}\lbrack n\rbrack}.}}$

Applying r_(j)[K_(j),n] to the above process, one can obtain {j}_([K)_(i) _(,n]), the resource assigned to j can then be assigned to user orusers based on the priority order from the scheduler in each individualcell. In case there are conflict in the assignment in the two scheduler,one or more iteration of the above process can be perform till eithercertain criteria are met or a pre-determined number of iterations isreached.

According to another embodiment of the present invention, theoptimization problem is to allocation radio resources to maximize thecell level utility function, which is a sum of cell or BTSs' utilityfunctions. The utility function can be individual cell based or a groupof cell based. Each cell or BTS or a group of cells can be assigned todifferent utility function.

According to one embodiment of the present invention, the optimizationproblem is to allocation radio resources to maximize the cost function,which is a sum of combination of individual users' utility functions insome cells and cell level utility function for other cells.

Assume the optimization is done for the users across N₁ cells with eachhaving M_(j) users and across N₂ cell with one utility function assignedto each cell. With rate based utility function, the optimization problemis to allocation radio resources to maximize

${\frac{1}{N_{1}}{\sum\limits_{j = 1}^{N_{1}}\left( {\frac{1}{M}{\sum\limits_{i = 1}^{M_{j}}{U_{ij}\left( {r_{ij}\lbrack n\rbrack} \right)}}} \right)}} + {\frac{1}{N_{2}}{\sum\limits_{j = 1}^{N_{2}}{{U_{j}\left( {r_{j}\lbrack n\rbrack} \right)}.}}}$

Using an OFDM system and subcarrier assignment as an example, and withthe same derivation as before, we define x_(ijnK) _(i) , as

$x_{{ijnK}_{i,}} = \left\{ \begin{matrix}{1,} & {{if}\mspace{14mu} {subcarrier}\mspace{14mu} {group}\mspace{14mu} K_{i,}\mspace{14mu} {is}\mspace{14mu} {assigned}\mspace{14mu} {to}\mspace{14mu} {user}\mspace{14mu} i\mspace{14mu} {in}\mspace{14mu} {cell}\mspace{14mu} j} \\{0,} & {{otherwise},}\end{matrix} \right.$

define x_(jnK) _(i) , as

$x_{{jnK}_{i,}} = \left\{ \begin{matrix}{1,} & {{if}\mspace{14mu} {subcarrier}\mspace{14mu} {group}\mspace{14mu} K_{i,}\mspace{14mu} {is}\mspace{14mu} {assigned}\mspace{14mu} {to}\mspace{14mu} {cell}\mspace{14mu} j} \\{0,} & {{otherwise},}\end{matrix} \right.$

the optimization problem as be formulated as

${\max\limits_{x}\left( {{\frac{1}{N_{1}}{\sum\limits_{j = 1}^{N_{1}}\left( {\frac{1}{M}{\sum\limits_{i = 1}^{M_{j}}{U_{ij}\left( {\Delta \; f{\sum\limits_{k \in K_{i}}{{c_{ij}\left\lbrack {k,n} \right\rbrack}x_{{ijnK}_{i,}}}}} \right)}}} \right)}} + {\frac{1}{N_{2}}{\sum\limits_{j = 1}^{N_{2}}\left( {U_{j}\left( {\Delta \; f{\sum\limits_{k \in K_{i}}{{c_{j}\left\lbrack {k,n} \right\rbrack}x_{{jnK}_{i,}}}}} \right)} \right)}}} \right)},$

subject to

${{{\sum\limits_{j = 1}^{N_{i}}\left( {\sum\limits_{i = 1}^{M_{j}}x_{{ijnK}_{i,}}} \right)} + {\sum\limits_{j = 1}^{N_{2}}x_{{jnK}_{i,}}}} = 1},{x_{{ijnK}_{i,}} \in \left\{ {0,1} \right\}},{x_{{jnK}_{i,}} \in \left\{ {0,1} \right\}}$

Hence the gradient scheduling algorithm is

$\left\{ {i,j} \right\}_{\lbrack{K_{i,},n}\rbrack} = {\underset{({i,j})}{\arg \; \max}\left\{ {{{wU}_{ij}^{\prime}\left( {{\overset{\_}{r}}_{ij}\left\lbrack {K_{i},n} \right\rbrack} \right)}{c_{ij}\left\lbrack {k,n} \right\rbrack}} \right\}}$

Clearly, when the average window length equals to the slot length, r_(ij)[K_(i),n]=r_(ij)[K_(i),n], one could drop the variable n in all ofthe above equations and the gradient scheduling algorithm becomes

$\left\{ {i,j} \right\}_{\lbrack K_{i}\rbrack} = {\underset{({i,j})}{\arg \; \max}\left\{ {{U_{ij}^{\prime}\left( {r_{ij}\left\lbrack K_{i} \right\rbrack} \right)}{c_{ij}\lbrack k\rbrack}} \right\}}$

According to one embodiment of the present invention, as special case ofthe above case with N₁=1 and N₂>=1, a macrocell BTS has multiple usersand one or more Femtocell BTSs. The resource management and schedulingcan be done among the macrocell BTS with respect to the utilityfunctions of the individual users and the utility functions of one ormore Femtocell BTSs.

According to one embodiment of the present invention, different antennaweighting in a multiply antenna systems based on beamforming orpre-coding can be used as part of the resource allocation and schedulingoptimization.

Using an OFDM system as an example, the antenna weighting enters theoptimization process via the power density downlink transmission powerdensity p_(j)[k,n] in the calculation of

c _(ij)(k,n)=f(ln(1+gp _(j) [k,n]q _(ij) [k,n])) bits/sec/Hz

The optimization process based on the first embodiment can be derivedfor power allocation using the similar method as in [1] and thereferences therein.

According to another embodiment of the present invention, a resourceallocation and scheduling optimization uses the objective which involvestwo levels of optimization. The first level is to maximize cost functionwith respect to users in individual cell or BTS, i.e. to allocationradio resources to maximize

$\frac{1}{M}{\sum\limits_{i = 1}^{M_{j}}{{U_{i}\left( {r_{i}\lbrack n\rbrack} \right)}.}}$

The second level is to maximize cost function with respect to users inmultiple cells or BTSs, i.e. to allocation radio resources to maximize

$\frac{1}{N}{\sum\limits_{j = 1}^{N}{\left( {\frac{1}{M}{\sum\limits_{i = 1}^{M_{j}}{U_{ij}\left( {r_{ij}\lbrack n\rbrack} \right)}}} \right).}}$

After that, the 1^(st) level resource allocation and scheduling willtake the outcome, including overall assigned resources and individualresource assignment, from 2^(nd) level scheduler as input andre-allocate and re-schedule the UEs in each cell and BTs. This processis iterated till either certain criteria is met or a pre-determinednumber of iterations is reached.

According to another embodiment of the present invention, a resourceallocation and scheduling optimization uses the objective which involvestwo levels of optimization. The first level is to maximize cost functionwith respect to users in individual cell or BTS, i.e. to allocationradio resources to maximize

$\frac{1}{M}{\sum\limits_{i = 1}^{M_{j}}{{U_{i}\left( {r_{i}\lbrack n\rbrack} \right)}.}}$

The second level is to maximize cell level cost function with respect tomultiple cells or BTSs, i.e. to allocation radio resources to maximize

$\frac{1}{N}{\sum\limits_{j = 1}^{N}{{U_{j}\left( {r_{j}\lbrack n\rbrack} \right)}.}}$

After that, the ^(1st) level resource allocation and scheduling willtake the outcome from ^(2nd) level scheduler as input and re-allocateand re-schedule the UEs in each cell and BTs. This process is iteratedtill either certain criteria is met or a pre-determined number ofiterations is reached again.

According to another embodiment of the present invention, the two levelresource allocation and scheduling can be done using different timegranularity with cell level resource allocation using longer timeinterval while individual user level scheduling using shorter timeinterval. More specifically, at each time interval T₂, radio resourcesis done by coordinated scheduler to maximize cell level cost function

$\frac{1}{N}{\sum\limits_{j = 1}^{N}{{U_{j}\left( {r_{j}\lbrack n\rbrack} \right)}.}}$

After the allocation of the resources to all the cells, the individualcell uses the assigned resource to schedule users by maximizingindividual user based cost function

$\frac{1}{M}{\sum\limits_{i = 1}^{M_{j}}{U_{i}\left( {r_{i}\lbrack n\rbrack} \right)}}$

at each time interval of T₁, where T₁<<T₂ or T₁<T₂. The scheduling isrepeated until reaching the T₂ interval, where the cell level resourceassignment is performed.

As special case of the above case, a macrocell BTS has multiple usersand one or more Femtocell BTSs. The resource allocation at time intervalT₂ will be done among the macrocell BTS and Femtocell BTS or BTSs withrespect to the utility functions of the cells. After that, at each timeinterval T₁ macrocell and each Femtocells schedules individual user andwith respect to users' utility functions.

According to one embodiment of the present invention, the users in acell can be grouped into user group that is being interfered by othercells or interfering other cells (we call it interfered user group); anduser group that is not (non-interfered user group). The criteria that isused to define the group can be based on interference level for theentire frequency band or in certain code channels in CDMA case orfrequency tones in OFDM case. It can also be based on certain qualityindicators such as bit error rate, packet error rate, and so on. It canalso be based on channel quality indicators. The above method can beapplied to a group of Femtocells or Picocells or between one Macrocelland one or more Femtocell and Picocell.

According to another embodiment of the present invention, the 1^(st)level in a resource allocation and scheduling is to maximize costfunction with respect to individual users in each individual cell orBTS, i.e. to allocation radio resources to maximize

${\frac{1}{M}{\sum\limits_{i \in M_{j}}{U_{i}\left( {r_{i}\lbrack n\rbrack} \right)}}},$

where M_(j) represents the users in each individual cell. The 2_(nd)level in a resource allocation and scheduling is to maximize costfunction in the cell level based on the users in the interfered usergroup, and the scheduling is done with respective to multiple cells orBTSs, i.e. to allocation radio resources to maximize

$\frac{1}{N}{\sum\limits_{j = 1}^{N}{U_{j}\left( {r_{j}\lbrack n\rbrack} \right)}}$

where U_(j)(r_(j)[n]) is the cell level cost function with respect tothe interfered user group in each of the N cells. After that, the 1^(st)level resource allocation and scheduling will take the outcome from2^(nd) level scheduler as input and re-allocate and re-schedule eitherall the users in a cell or only the interfered users in each cell andBT. This process is iterated till either certain criteria is met or apre-determined number of iterations is reached.

According to one embodiment of the present invention, the total radioresources are divided into multiple levels with some are served strictlyfor each cell's private use, some for common use so they can beallocated by the coordinated scheduler. It is possible to have anotherportion of resources that can be used in either of the above two casesin an ad hoc basis.

According to another embodiment of the present invention, the allocationof the private and common resources can also be adaptive over time, andit should have longer time adaptation rate compared to the userscheduler. The allocation of the common and private resources acrosscells can use similar principle outlined in the previous embodiment,i.e. the allocation of the private and common resources is done bycoordinated resource management to maximize cell level cost function

$\frac{1}{N}{\sum\limits_{j = 1}^{N}{{U_{j}\left( {r_{j}\lbrack n\rbrack} \right)}.}}$

After the allocation of the resources to all the cells, the individualcell can use the assigned resource to schedule users based on thefollowing embodiments.

According to another embodiment of the present invention, the 1^(st)level in a resource allocation and scheduling is to allocate privateresources to non-interfered users by maximizing cost function withrespect to individual user in each individual cell or BTS, i.e. toallocation radio resources to maximize

${\frac{1}{M_{G}}{\sum\limits_{i \in {({M_{j} - G_{j}})}}{U_{i}\left( {r_{i}\lbrack n\rbrack} \right)}}},$

where M_(j) represents all the users in each individual cell and G_(j)represents interfered users. The 2^(nd) level in a resource allocationand scheduling is to allocate common resources to interfered users bymaximizing cost function in the cell level based on the users in theinterfered user group. The scheduling can be done with respective tomultiple cells or BTSs, i.e. to allocation radio resources to maximize

$\frac{1}{N}{\sum\limits_{j = 1}^{N}{U_{j}\left( {r_{j}\lbrack n\rbrack} \right)}}$

where U_(j)(r_(j)[n]) is the cell level cost function with respect tothe interfered user group in each of the N cells; or the scheduling canbe done with respective to interfered users in multiple cells or BTSs,i.e. to allocation radio resources to maximize

$\frac{1}{N}{\sum\limits_{j = 1}^{N}{\left( {\frac{1}{M_{G}}{\sum\limits_{i \in G_{j}}{U_{ij}\left( {r_{ij}\lbrack n\rbrack} \right)}}} \right).}}$

According to another embodiment of the present invention, the 1^(st)level in a resource allocation and scheduling is to maximize costfunction with respect to all of the users in each individual cell or BTSby using the private resources. The 2^(nd) level in a resourceallocation and scheduling is to maximize cost function with respect tothose users who have not been assigned private resources or have notbeen assigned private resources sufficiently. This is done with respectto multiple cells or BTSs by using common resources. This process canalso be iterated till either certain criteria is met or a pre-determinednumber of iterations is reached.

According to another embodiment of the present invention, the 1^(st)level in a resource allocation and scheduling is to maximize costfunction with respect to the users across multiply cells by using thecommon resources. The 2^(nd) level in a resource allocation andscheduling is to maximize cost function with respect to those users whohave not been assigned common resources or have not been assigned commonresources sufficiently. This is done in each individual cell or BTS byusing private resources. This process can also be iterated till eithercertain criteria is met or a pre-determined number of iterations isreached.

According to another embodiment of the present invention, the 1^(st)level in a resource allocation and scheduling is to maximize cell levelcost function with respect to multiple cells or BTSs by using the commonresources. The 2n^(d) level in a resource allocation and scheduling isto maximize cost function with respect to all the users in eachindividual cell or BTS by using common sources being assigned to eachcell or BTS as well as its own private resources. This process can alsobe iterated till either certain criteria is met or a pre-determinednumber of iterations is reached.

According to another embodiment of the present invention, the BTSs thatperform the resources allocations and scheduling can be in differenttiers. One example is that one BTS is macrocell BTSs and another BTS isFemtocell BTS. Two of them can coordinate the resource assignment andscheduling based on all of the previous embodiments.

Even though data rate based utility function is used in the abovederivation and examples, other utility function can be used and theapproach can be applied.

According to another embodiment of the present invention, thecoordination between the BTSs can be in a completely centralized way,partially distributed way, or completely distributed way.

According to another embodiment of the present invention, when thecoordination is completely centralized, the BTSs send the measurementsand information required for resource allocations to the network viain-band signaling or out-of-band signaling or a combination of both. Thenetwork uses this information to perform resource allocation andscheduling. This corresponding allocation and coordination informationare sent back to each BTSs.

According to another embodiment of the present invention, when thecoordination is partially centralized, the BTSs send the measurementsand information required for resource allocations to the network viain-band signaling or out-of-band signaling or a combination of both. Thenetwork uses this information to perform resource allocation andscheduling. This corresponding allocation and coordination informationare sent back to each BTSs. The scheduler in each BTS uses theinformation sent back by the centralized network resource manager asinput to its scheduler in a way that they would have the same priorityas other resources and UEs. Different scheduling and resource managementalgorithms can be applied here.

According to another embodiment of the present invention, when thecoordination is completely distributed, the BTSs send the measurementsand information required for resource allocations to its neighbor BTSsdetermined by its neighbor list via in-band signaling or out-of-bandsignaling or a combination of both. The information sent to specificneighbor only includes those related to that BTS.

According to one embodiment of the present invention, the receivingneighbor BTSs will accept the request, deny the request or send back amodified version of the request based on predetermined algorithms. Oneexample of the modified version of the request can be granting with lessresources than requested or granting the resources but with a shortertime period or a time delay.

According to another embodiment of the present invention, the neighborBTS that received the information and requests from other neighbor BTSsshall use the information either as a constraint to its scheduler or aspart of the overall input to its scheduler. Depending on outcome fromthe scheduling results, the 2nd BTS decides whether to accept, deny orpropose a new resource allocation. The 1st and the 2nd BTSs shall usethe following procedure depending on whether the request from the 1stBTS is accepted, denied or modified.

When the request is denied, the 1st BTS can either renegotiate e.g. senda modified request with less resource requirements, or accept theresults as it and run the scheduling and resource allocation algorithmwithout any constraints. The 2nd BTS will do the same.

When the request is granted, the 1st BTS treats the granted resourcestogether from other neighbor BTSs as an input to its scheduler while the2nd BTS should take into account of the resource already granted to the1st BTS as a constraint to its scheduler.

When the request is neither accepted nor denied by a neighbor BTS, the2nd BTS will send back a proposed resource grant plan that is based onthe available resources determined by its scheduler or resourcemanagement entity to the 1st BTS. The 1st BTS can either decide toaccept the new proposal or to re-negotiate, i.e. send a modified requestwith less resource requirements. In the case that the 1st BTS acceptsthe new proposal, the 1st BTS will acknowledge to the 2nd BTS. The 1stBTS then treats the granted resources together from other neighbor BTSsas an input to its scheduler while the 2nd BTS should take into accountof the resource already granted to the 1st BTS as a constraint to itsscheduler.

Those of skill will appreciate that the various illustrative logicalblocks, modules, and algorithm steps described in connection with theembodiments disclosed herein can often be implemented as electronichardware, computer software, or combinations of both. To clearlyillustrate this interchangeability of hardware and software, variousillustrative components, blocks, modules, and steps have been describedabove generally in terms of their functionality. Whether suchfunctionality is implemented as hardware or software depends upon theparticular system and design constraints imposed on the overall system.Skilled persons can implement the described functionality in varyingways for each particular system, but such implementation decisionsshould not be interpreted as causing a departure from the scope of theinvention. In addition, the grouping of functions within a module, blockor step is for ease of description. Specific functions or steps can bemoved from one module or block without departing from the invention.

The various illustrative logical blocks and modules described inconnection with the embodiments disclosed herein can be implemented orperformed with a general purpose processor, a digital signal processor(DSP), a text messaging system specific integrated circuit (ASIC), afield programmable gate array (FPGA) or other programmable logic device,discrete gate or transistor logic, discrete hardware components, or anycombination thereof designed to perform the functions described herein.A general-purpose processor can be a microprocessor, but in thealternative, the processor can be any processor, controller,microcontroller, or state machine. A processor can also be implementedas a combination of computing devices, for example, a combination of aDSP and a microprocessor, a plurality of microprocessors, one or moremicroprocessors in conjunction with a DSP core, or any other suchconfiguration.

The steps of a method or algorithm described in connection with theembodiments disclosed herein can be embodied directly in hardware, in asoftware module executed by a processor, or in a combination of the two.A software module can reside in RAM memory, flash memory, ROM memory,EPROM memory, EEPROM memory, registers, hard disk, a removable disk, aCD-ROM, or any other form of storage medium. An exemplary storage mediumcan be coupled to the processor such that the processor can readinformation from, and write information to, the storage medium. In thealternative, the storage medium can be integral to the processor. Theprocessor and the storage medium can reside in an ASIC.

The above description of the disclosed embodiments is provided to enableany person skilled in the art to make or use the invention. Variousmodifications to these embodiments will be readily apparent to thoseskilled in the art, and the generic principles described herein can beapplied to other embodiments without departing from the spirit or scopeof the invention. Thus, it is to be understood that the description anddrawings presented herein represent a presently preferred embodiment ofthe invention and are therefore representative of the subject matter,which is broadly contemplated by the present invention. It is furtherunderstood that the scope of the present invention fully encompassesother embodiments that may become obvious to those skilled in the art.

What is claimed is:
 1. A method of managing wireless resourcescomprising: identifying a group of cells having at least two neighboringcells; identifying a group of users from the group of the cells;providing a utility function based on an instantaneous data rate foreach user of the group of users; and allocating the wireless resourcesto the each user based on a cost function for the group of users,wherein the cost function is based on the utility function.
 2. Themethod as claimed in claim 1, wherein each user has a different utilityfunction.
 3. The method as claimed in claim 1, wherein there are morethan one groups of users identified from at least two cells with eachuser assigned one utility function.
 4. The method as claimed in claim 1,wherein there are N cells with one utility function assigned to users ineach cell.
 5. The method as claimed in claim 1, wherein the allocatingof the wireless resources is realized by coordination among the cells.6. The method as claimed in claim 5, wherein the coordination among thecells is centralized.
 7. The method as claimed in claim 5, wherein thecoordination among the cells is partially distributed.
 8. The method asclaimed in claim 5, wherein the coordination among the cells iscompletely distributed.
 9. A method of managing wireless resourcescomprising: identifying a group of cells; providing a utility functionbased on a data rate for each user of one cell; and allocating a portionof radio resource to each cell based on a cost function for theidentified group of cells, wherein the cost function is based on theutility function.
 10. The method as claimed in claim 9, wherein eachcell has a different utility function.
 11. The method as claimed inclaim 9, wherein there are N cells with one utility function assigned toeach cell.
 12. The method as claimed in claim 9, wherein a group ofcells has the same utility function while others have different utilityfunctions.
 13. The method as claimed in claim 9, wherein the selectedcells only contain portion of the total users.
 14. The method as claimedin claim 9, wherein users in a cell have the same utility function asthe cell.
 15. The method as claimed in claim 9, wherein users in a cellhave the different utility function than the cell.
 16. The method asclaimed in claim 9, wherein the allocating of the portion of the radioresource is realized by using coordination among the cells.
 17. Themethod as claimed in claim 16, wherein the coordination among the cellsis centralized.
 18. The method as claimed in claim 16, wherein thecoordination among the cells is partially distributed.
 19. The method asclaimed in claim 16, wherein the coordination among the cells iscompletely distributed.
 20. A method of managing wireless resourcescomprising: identifying a group of cells; identifying a group of usersfrom the group of cells; providing a utility function for a cell or auser or both in the identified groups; and allocating a portion of radioresource to each cell or each user based on one cost function for theidentified group of users and one cost function for the identified groupof cells, wherein the one cost function for the identified group ofusers is based on the utility function for the user, and the one costfunction for the identified group of cells is based on the utilityfunction for the cell.
 21. The method as claimed in claim 20, whereineach cell has a different utility function.
 22. The method as claimed inclaim 20, wherein the step of allocating includes the step of usingcoordination among the cells.
 23. The method as claimed in claim 20,wherein users in a cell having the different utility functions.
 24. Themethod as claimed in claim 20, wherein the allocating of the portion ofthe radio resource is realized by using coordination among the cells.25. The method as claimed in claim 24, wherein the coordination amongthe cells is centralized.
 26. The method as claimed in claim 24, whereinthe coordination among the cells is partially distributed.
 27. Themethod as claimed in claim 24, wherein the coordination among the cellsis completely distributed.